Stochastic Approximation Algorithms for Constrained Optimization Problems
نویسندگان
چکیده
منابع مشابه
Algorithms Column: Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Uncertainty is a facet of many decision environments and might arise for various reasons, such as unpredictable information revealed in the future, or inherent fluctuations caused by noise. Stochastic optimization provides a means to handle uncertainty by modeling it by a probability distribution over possible realizations of the actual data, called scenarios. The field of stochastic optimizati...
متن کاملDeterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
Due to their fundamental nature and numerous applications, sphere constrained polynomial optimization problems have received a lot of attention lately. In this paper, we consider three such problems: (i) maximizing a homogeneous polynomial over the sphere; (ii) maximizing a multilinear form over a Cartesian product of spheres; and (iii) maximizing a multiquadratic form over a Cartesian product ...
متن کاملApproximation Algorithms for Stochastic Optimization Problems in Operations Management
This article provides an introduction to approximation algorithms in stochastic optimization models arising in various application domains, including central areas of operations management, such as scheduling, facility location, vehicle routing problems, inventory and supply chain management and revenue management. Unfortunately, these models are very hard to solve to optimality both in theory ...
متن کاملHedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our problems range from the graph-theoretic (shortest path, vertex cover, facility location) to set-theoretic (set cover, bin packing), and contain representatives with different approximation ratios. The approximation ratio of the s...
متن کاملSampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
We consider twoand multistage versions of stochastic combinatorial optimization problems with recourse: in this framework, the instance for the combinatorial optimization problem is drawn from a known probability distribution π and is only revealed to the algorithm over two (or multiple) stages. At each stage, on receiving some more information about the instance, the algorithm is allowed to bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1974
ISSN: 0090-5364
DOI: 10.1214/aos/1176342759